bit hilani

نویسندگان

فرشید ایروانی قدیم

فرشید ایروانی قدیم استادیار گروه باستان شناسی، دانشکدة مرمت، دانشگاه هنر اصفهان مرتضی حصاری

استادیار گروه باستان شناسی، دانشکده مرمت، دانشگاه هنر اصفهان ایمان افضلی

کارشناس ارشد باستان شناسی، دانشگاه آزاد اسلامی، واحد تهران مرکزی

چکیده

this paper seeks to document the specific structural patterns of bit hilanis architecture which were in used in the ancient near east from the second to the first millennium b.c. the recognition of bit hilanis architectural characteristics as well as their provenances and their spread from anatoly to palestine have always remained the important issues to be addressed by art historians and archaeologists. the main goal of this paper is to explain the architectural, religious and economic aspects of bit hilanis within the anatolian cultural contexts and assess their cultural interactions with the adjacent areas. to do this we tried to provide a detailed characteristic of bit hilani’s architecture and their related arts as the basis to compare material remains from a group of bit hilanis. the comparisons were also developed through regarding the descriptions of bit hilanis by the different written sources as through which some parts of either the bit hilanis structures or their decoration details could be reconstructed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimum Drill Bit Selection by Using Bit Images and Mathematical Investigation

This study is designed to consider the two important yet often neglected factors, which are factory recommendation and bit features, in optimum bit selection. Image processing techniques have been used to consider the bit features. A mathematical equation, which is derived from a neural network model, is used for drill bit selection to obtain the bit’s maximum penetration rate that corresponds ...

متن کامل

Binar Shuffle Algorithm: Shuffling Bit by Bit

Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck is shuffled to create a random permutation. Shuffling is used to assure that an aggregate of data elements for a sequence S is randomly arranged, but avoids a...

متن کامل

Bit-Precise Reasoning Beyond Bit-Blasting

In the field of hardware and software verification, many applications require to determine satisfiability of first-order-logic with respect to one or more background theories, also referred to as Satisfiability Modulo Theories (SMT). The majority of these applications relies on bit-precise reasoning as provided by SMT solvers for the quantifier-free theory of fixed-size bit-vectors, often combi...

متن کامل

Pixel bit-depth increase by bit replication

In many applications, such as inverse dithering, it is necessary to increase the pixel bit-depth of images by expanding q -bit integer values to m -bit integer values ( q m > ). This paper describes a simple and efficient method that uses bit replication, instead of conventional multiplication, to achieve this expansion. First, we show that the optimal number of repetitions is given by } / { ce...

متن کامل

Bit Inference

Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage in Boolean satisability procedures. Sets of variables are represented as bit vectors and formulæ as matrices. Symbolic operations are performed by bit arithmetic. As examples of inference done in this fashion, we des...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023